Theta: portfolio of CEGAR-based analyses with dynamic algorithm selection (Competition Contribution)
نویسندگان
چکیده
Abstract Theta is a model checking framework based on abstraction refinement algorithms. In SV-COMP 2022, we introduce: 1) reasoning at the source-level via direct translation from C programs; 2) support for concurrent programs with interleaving semantics; 3) mitigation non-progressing loops; 4) SMT-LIB-compliant solvers. We combine all of aforementioned techniques into portfolio dynamic algorithm selection.
منابع مشابه
SATzilla: Portfolio-based Algorithm Selection for SAT
It has been widely observed that there is no single “dominant” SAT solver; instead, different solvers perform best on different instances. Rather than following the traditional approach of choosing the best solver for a given class of instances, we advocate making this decision online on a per-instance basis. Building on previous work, we describe SATzilla, an automated approach for constructin...
متن کاملOutperformance Testing of a Dynamic Assets Portfolio Selection Supplemented with a Continuous Paths Levy Process
This study aims at getting a better performance for optimal stock portfolios by modeling stocks prices dynamics through a continuous paths Levy process. To this end, the share prices are simulated using a multi-dimensional geometric Brownian motion model. Then, we use the results to form the optimal portfolio by maximizing the Sharpe ratio and comparing the findings with the outputs of the conv...
متن کاملA Hybrid Grey based Two Steps Clustering and Firefly Algorithm for Portfolio Selection
Considering the concept of clustering, the main idea of the present study is based on the fact that all stocks for choosing and ranking will not be necessarily in one cluster. Taking the mentioned point into account, this study aims at offering a new methodology for making decisions concerning the formation of a portfolio of stocks in the stock market. To meet this end, Multiple-Criteria Decisi...
متن کاملA Hybrid Meta-Heuristic Algorithm based on Imperialist Competition Algorithm
The human has always been to find the best in all things. This Perfectionism has led to the creation of optimization methods. The goal of optimization is to determine the variables and find the best acceptable answer Due to the limitations of the problem, So that the objective function is minimum or maximum. One of the ways inaccurate optimization is meta-heuristics so that Inspired by nature, ...
متن کاملRobust portfolio selection with polyhedral ambiguous inputs
Ambiguity in the inputs of the models is typical especially in portfolio selection problem where the true distribution of random variables is usually unknown. Here we use robust optimization approach to address the ambiguity in conditional-value-at-risk minimization model. We obtain explicit models of the robust conditional-value-at-risk minimization for polyhedral and correlated polyhedral am...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2022
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-99527-0_34